A Theory of Timestamp-Based Concurrency Control for Nested Transactions
نویسندگان
چکیده
We present a rigorous framework for analyzing timestampbased concurrency control and recovery algorithms for nested transactions. We define a local correctness property, local static atomic@, that affords useful modularity. We show that local static atomicity of each object is sufficient to ensure global serializability. We present generalizations of algorithms due to Reed and Herlihy, and show that each ensures local static atomicity.
منابع مشابه
Timestamp Ordering and Nested Transactions
Using the [LM] model for database concurrency control and recovery, we describe a general method for proving serial correctness of concurrency control algorithms which use timestamp ordering. This method is then used to prove serial correctness of Reed's [R] object history mechanism. Thesis Supervisor: Title: Nancy Lynch Professor of Computer Science, Massachusetts Institute of Technology
متن کاملTRANSACTION SYNCHRONISATION IN OBJECT BASESy
We propose a formal model of concurrency control in object bases. An object base is like a database except that information is represented in terms of \objects" that encapsulate both data and the procedures through which the data can be manipulated. The model generalises the classical model of database concurrency control: it allows for nested transactions (as opposed to at transactions) which ...
متن کاملScheduling Adaptive Transactions in Real-Time Databases
A new transaction model, called the Adaptive Transaction Model, is proposed for Real-Time Database Management Systems (RTDBMSs) applications. The Adaptive Transaction Model is an extended transaction model with a nested structure containing optional and required subtransactions. Adaptive Transactions (ATs) have time constraints to support real-time database applications. Optional substransactio...
متن کاملConcurrency control based on role concept
A Role-Based Access Control (RBAC) model is used to make a system secure. In addition to keeping systems secure, objects have to be consistent in the presence of multiple transactions. Traditional locking protocols and timestamp ordering schedulers are based on ‘first-comer-winner’ and ‘timestamp order’ principles to make multiple conflicting transactions serialisable, respectively. In this pap...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کامل